Optimization over Young diagrams

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometries from Young Diagrams

Type IIB string theory on spacetimes that are asymptotically AdS5×S can be defined using four dimensional N = 4 super Yang-Mills theory. Six of the dimensions of the string theory are holographically reconstructed in the Yang-Mills theory. In this article we study how these dimensions and local physics in these dimensions emerge. We reorganize the dynamics of the 1 2 BPS sector of the field the...

متن کامل

Planar diagrams from optimization

S.K. Nechaev, A.N. Sobolevski, O.V. Valba LPTMS, Université Paris Sud, 91405 Orsay Cedex, France P.N. Lebedev Physical Institute of the Russian Academy of Sciences, 119991, Moscow, Russia Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), 127994 Moscow, Russia National Research University Higher School of Economics, 101000 Moscow, Russia M...

متن کامل

On hooks of Young diagrams

The well-known fact that there is always one more addable than removable box for a Young diagram is generalized to arbitrary hooks. As an application, this implies immediately a simple proof of a conjecture of Regev and Vershik 3] for which inductive proofs have recently been given by Regev and Zeilberger 4] and Janson 1].

متن کامل

Discrete Optimization with Decision Diagrams

We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, while restricted BDDs supply a primal heuristic. Each problem is given a dynamic programming model that allows one to...

متن کامل

The Permutation Group and Young Diagrams

The permutation, or symmetric, group, Sn is interesting at least partly because it contains subgroups isomorphic to all groups of order ≤ n. This result is known as “Cayley’s theorem”. It is also of great value in tensor analysis as the means to describe the tensor space in terms of symmetries under permutations of indicies. Here, we develop a diagrammatic approach to determining the irreducibl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2020

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-020-00982-z